The spectral radius of graphs without trees of diameter at most four
نویسندگان
چکیده
منابع مشابه
Trees with minimal index and diameter at most four
In this paper we consider the trees with fixed order n and diameter d ≤ 4. Among these trees we identify those trees whose index is minimal. © 2009 Elsevier B.V. All rights reserved.
متن کاملThe minimal spectral radius of graphs with a given diameter
The spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency matrix) plays an important role in modeling virus propagation in networks. In fact, the smaller the spectral radius, the larger the robustness of a network against the spread of viruses. Among all connected graphs on n nodes the pathPn has minimal spectral radius. However, its diameter D, i.e., the maxim...
متن کاملOn the spectral radius of bipartite graphs with given diameter
Article history: Received 17 March 2008 Accepted 9 October 2008 Available online 3 December 2008 Submitted by R.A. Brualdi AMS classification: 05C50
متن کاملGraphs with given diameter maximizing the spectral radius
We determine the graphs with maximal spectral radius among the ones on n nodes with diameter D. © 2007 Elsevier Inc. All rights reserved. AMS classification: 05C50; 05E99; 94C15
متن کاملGroup connectivity of graphs with diameter at most 2
Let G be an undirected graph, A be an (additive) abelian group and A∗ = A − {0}. A graph G is A-connected if G has an orientation D(G) such that for every function b : V (G) 7→ A satisfying ∑ v∈V (G) b(v) = 0, there is a function f : E(G) 7→ A∗ such that at each vertex v ∈ V (G), the amount of f values on the edges directed out from v minus the amount of f values on the edges directed into v eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear and Multilinear Algebra
سال: 2019
ISSN: 0308-1087,1563-5139
DOI: 10.1080/03081087.2019.1628911